Worst Case Complexity of Problems with Random Information Noise
نویسندگان
چکیده
منابع مشابه
Decision problems for partial specifications: empirical and worst-case complexity
Partial specifications allow approximate models of systems such as Kripke structures, or labeled transition systems to be created. Using the abstraction possible with these models, an avoidance of the state-space explosion problem is possible, whilst still retaining a structure that can have properties checked over it. A single partial specification abstracts a set of systems, whether Kripke, l...
متن کاملThe Worst Case Complexity of the Fredholm Equation of the Second Kind with Non-Periodic Free Term and Noise Information
This paper deals with the complexity of the Fredholm equation Lu = f of the second kind with f 2 W r;p ((). The problem elements are free term f and belong to the unit ball of W r;p ((). Available information about the problem consists of evaluations of f and is assumed to be corrupted by uniformly bounded noise. The absolute error in each noisy evaluation is at most. First, we give estimation ...
متن کامل1 Worst - Case vs . Average - Case Complexity
So far we have dealt mostly with the worst-case complexity of problems. We might also wonder aobut the average-case complexity of a problem, namely, how difficult the problem is to solve for an instance chosen randomly from some distribution. It may be the case for a certain problem that hard instances exist but are extremely rare. Many reductions use very specifically constructed problems, so ...
متن کاملThe Worst Case Complexity of Maximum Parsimony
One of the core classical problems in computational biology is that of constructing the most parsimonious phylogenetic tree interpreting an input set of sequences from the genomes of evolutionarily related organisms. We reexamine the classical maximum parsimony (MP) optimization problem for the general (asymmetric) scoring matrix case, where rooted phylogenies are implied, and analyze the worst...
متن کاملWorst case complexity of direct search
In this paper we prove that the broad class of direct-search methods of directional type based on imposing sufficient decrease to accept new iterates shares the worst case complexity bound of steepest descent for the unconstrained minimization of a smooth function, more precisely that the number of iterations needed to reduce the norm of the gradient of the objective function below a certain th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1996
ISSN: 0885-064X
DOI: 10.1006/jcom.1996.0026